M/G/∞ tandem queues

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Work-Conserving Tandem Queues

Consider a tandem queue of two single-server stations with only one server for both stations, who may allocate a fraction α of the service capacity to station 1 and 1−α to station 2 when both are busy. A recent paper treats this model under classical Poisson, exponential assumptions. Using work conservation and FIFO, we show that on every sample path (no stochastic assumptions), the waiting tim...

متن کامل

Convexity in tandem queues

We derive convexity results and related properties for the value functions of tandem queueing systems. The results for standard multi-server queues are new. For completeness we also prove and generalize existing results on tandems of controllable queues. The results can be used to compare queueing systems. This is done for systems with and without batch arrivals, and for systems with different ...

متن کامل

Analysis of tandem fluid queues

We consider a model consisting of two fluid queues driven by the same background continuous-time Markov chain, such that the rates of change of the fluid in the second queue depend on whether the first queue is empty or not. We analyse this tandem model using operator-analytic methods.

متن کامل

A Monotonicity Theorem for Tandem Queues

Tandem queues are often used for performance mod-eling in production lines, computer systems and communication networks. Consider a series of tandem rst-come-rst-served queues with single servers. The buuers may be nite or innnite. When a nite buuer is full, the upstream server may suuer from transfer blocking or service blocking. A job's service requirements at various servers may be correlate...

متن کامل

Server allocation for zero buffer tandem queues

In this paper we consider the problem of allocating servers to maximize throughput for tandem queues with no buffers. We propose an allocation method that assigns servers to stations based on the mean service times and the current number of servers assigned to each station. A number of simulations are run on different configurations to refine and verify the algorithm. The algorithm is proposed ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Stochastic Processes and their Applications

سال: 1984

ISSN: 0304-4149

DOI: 10.1016/0304-4149(84)90168-6